Generalized k-Center Problems
نویسندگان
چکیده
The k-center problem with triangle inequality is that of placing k center nodes in a weighted undirected graph in which the edge weights obey the triangle inequality, so that the maximum distance of any node to its nearest center is minimized. In this paper, we consider a generalization of this problem where, given a number p, we wish to place k centers so as to minimize the maximum distance of any node to its p closest center. We consider three di erent versions of this reliable k-center problem depending on which of the nodes can serve as centers and non-centers and derive best possible approximation algorithms for all three versions.
منابع مشابه
Boundary Value Problems in Generalized Thermodiffusive Elastic Medium
In the present study, the boundary value problems in generalized thermodiffusive elastic medium has been investigated as a result of inclined load. The inclined load is assumed to be a linear combination of normal load and tangential load. Laplace transform with respect to time variable and Fourier transform with respect to space variable are applied to solve the problem. As an application of t...
متن کاملGeneralized p-Center problems: Complexity results and approximation algorithms
In an earlier paper Hud91], two \alternative" p-Center problems, where the centers serving customers must be chosen so that exactly one node from each of p prespeciied disjoint pairs of nodes is selected, were shown to be NP-complete. This paper considers a generalized version of these problems, in which the nodes from which the p servers are to be selected are partitioned into k sets and the n...
متن کاملStudies with a Generalized Neuron Based PSS on a Multi-Machine Power System
An artificial neural network can be used as an intelligent controller to control non-linear, dynamic system through learning. It can easily accommodate non-linearities and time dependencies. Most common multi-layer feed-forward neural networks have the drawbacks of large number of neurons and hidden layers required to deal with complex problems and require large training time. To overcome these...
متن کاملResearch Proposal Fully Dynamic Approximate Clustering
Given a metric (U, d) with |U | = n, a subset S ⊆ U with |S| = l, a non-negative function w : U → <, and an integer k ≤ l, the generalized static k-center and k-median problems ask to pick a subset X ⊆ S with |X| = k so as to minimize maxx∈U d(x,X) and ∑ x∈U d(x,X) · w(x), respectively, where d(x,X) = miny∈X d(x, y). Each point in X is called a center and each point in U is assigned to its clos...
متن کاملData Center Scheduling, Generalized Flows, and Submodularity
Inspired by problems in data center scheduling, we study the submodularity of certain scheduling problems as a function of the set of machine capacities and the corresponding implications. In particular, we • give a short proof that, as a function of the excess vector, maximum generalized flow is submodular and minimum cost generalized flow is supermodular; • extend Wolsey’s approximation guara...
متن کامل